Scheduling and rescheduling with iterative repair
نویسندگان
چکیده
منابع مشابه
Scheduling and rescheduling with iterative repair
This paper describes the GERRY scheduling and rescheduling system being applied to coordinate Space Shuttle Ground Processing. The system uses constraint-based iterative repair, a technique that starts with a complete but possibly flawed schedule and iteratively improves it by using constraint knowledge within repair heuristics. In this paper we explore the tradeoff between the informedness and...
متن کاملIterative Repair for Scheduling and Rescheduling
This paper describes an iterative repair search method called constraint-based simulated annealing. Simulated annealing is a hill climbing search technique capable of escaping local minima. We demonstrate the utility of our constraint-based framework by comparing search performance with and without the constraint framework on a suite of randomly generated problems. We also show results of apply...
متن کاملRescheduling with Iterative Repair
Monte Zweben Eugene Davis* Brian Daun t Michael Deale$ NASA Ames Research Center M.S. 269-2 Moffett Field, California 94035 This paper presents a new approach to rescheduling called constraint-based iterative repair. This approach gives our system the ability to satisfy domain constraints, address optimization concerns, minimize perturbation to the original schedule, and produce modified schedu...
متن کاملMultiagent Meeting Scheduling with Rescheduling
We are interested in how personal agents who perform calendar management on behalf of their human users can schedule meetings effectively. A key difficulty of concern is deciding when to reschedule an existing meeting in favor of a new meeting. We model the meeting scheduling problem as a special subclass of distributed constraint reasoning (DCR) called the Incremental, Limited Information Exch...
متن کاملProduction Scheduling and Rescheduling with Genetic Algorithms
A general model for job shop scheduling is described which applies to static, dynamic and non-deterministic production environments. Next, a Genetic Algorithm is presented which solves the job shop scheduling problem. This algorithm is tested in a dynamic environment under different workload situations. Thereby, a highly efficient decoding procedure is proposed which strongly improves the quali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics
سال: 1993
ISSN: 0018-9472
DOI: 10.1109/21.257756